Lambda Calculus: Models and Theories
نویسنده
چکیده
In this paper we give an outline of recent results concerning theories and models of the untyped lambda calculus. Algebraic and topological methods have been applied to study the structure of the lattice of λ-theories, the equational incompleteness of lambda calculus semantics, and the λ-theories induced by graph models of lambda calculus.
منابع مشابه
Minimal lambda-theories by ultraproducts
A longstanding open problem in lambda calculus is whether there exist continuous models of the untyped lambda calculus whose theory is exactly the least lambda-theory λβ or the least sensible lambda-theory H (generated by equating all the unsolvable terms). A related question is whether, given a class of lambda models, there is a minimal lambda-theory represented by it. In this paper, we give a...
متن کاملApplying Universal Algebra to Lambda Calculus
The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λ-theories (= equational extensions of untyped λ-calculus) and the models of lambda calculus via universal algebra. This includes positive or negative answers to several questions raised in these years as well as several independent results, the state of the art ...
متن کاملA Continuum of Theories of Lambda Calculus without Semantics
In this paper we give a topological proof of the following result: There exist 2@0 lambda theories of the untyped lambda calculus without a model in any semantics based on Scott’s view of models as partially ordered sets and of functions as monotonic functions. As a consequence of this result, we positively solve the conjecture, stated by Bastonero-Gouy [6, 7] and by Berline [10], that the stro...
متن کاملEffective lambda-models vs recursively enumerable lambda-theories
A longstanding open problem is whether there exists a non-syntactical model of the untyped λ-calculus whose theory is exactly the least λ-theory λβ . In this paper we investigate the more general question of whether the equational/order theory of a model of the untyped λ-calculus can be recursively enumerable (r.e. for brevity). We introduce a notion of effective model of λ-calculus, which cove...
متن کاملOrder-Incompleteness and Finite Lambda Models (Extended Abstract)
Many familiar models of the type-free lambda calculus are constructed by order theoretic methods. This paper provides some basic new facts about ordered models of the lambda calculus. We show that in any partially ordered model that is complete for the theory ofβorβη-conversion, the partial order is trivial on term denotations. Equivalently, the open and closed term algebras of the type-free la...
متن کامل